Linear area upward drawings of AVL trees
نویسندگان
چکیده
We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. © 1998 Elsevier Science B.V.
منابع مشابه
Strictly-upward Drawings of Ordered Search Trees
We prove that any logarithmic binary tree admits a linear-area straight-line strictly-upward planar grid drawing (in short, strictly-upward drawing), that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates. Informally, a logarit...
متن کاملUpward Tree Drawings with Optimal
Rooted trees are usually drawn planar and upward, i.e., without crossings and without any parent placed below its child. In this paper we investigate the area requirement of planar upward drawings of rooted trees. We give tight upper and lower bounds on the area of various types of drawings, and provide linear-time algorithms for constructing optimal area drawings. Let T be a bounded-degree roo...
متن کاملArea-eecient Upward Tree Drawings
Rooted trees are usually drawn planar and upward , i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
متن کاملPlanar upward tree drawings with optimal area
Rooted trees are usually drawn planar and upward i e without crossings and with out any parent placed below its child In this paper we investigate the area requirement of planar upward drawings of rooted trees We give tight upper and lower bounds on the area of various types of drawings and provide linear time algorithms for constructing optimal area drawings Let T be a bounded degree rooted tr...
متن کاملArea-eecient Algorithms for Upward Straight-line Tree Drawings ?
In this paper, we investigate planar upward straight-line grid drawing problems for bounded-degree rooted trees so that a drawing takes up as little area as possible. A planar upward straight-line grid tree drawing satisses the following four constraints: (1) all vertices are placed at distinct grid points (grid), (2) all edges are drawn as straight lines (straight-line), (3) no two edges in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 9 شماره
صفحات -
تاریخ انتشار 1998